What (who) is recursive functions - definition
WIKIMEDIA DISAMBIGUATION PAGE
Non-recursive; Recursive functions; Recursive function (disambiguation)
General recursive function
ONE OF SEVERAL EQUIVALENT DEFINITIONS OF A COMPUTABLE FUNCTION
Partial recursive function; Total recursive function; Mu-recursive; Mu recursive function; Mu-recursive function; Recursive function theory; M-recursive function; Μ recursion; General-recursive; General recursive; Recursive function (computability); Μ-recursive function; Μ-recursive
In mathematical logic and computer science, a general recursive function, partial recursive function, or μ-recursive function is a partial function from natural numbers to natural numbers that is "computable" in an intuitive sense – as well as in a formal one. If the function is total, it is also called a total recursive function (sometimes shortened to recursive function).
Primitive recursive function
FUNCTION THAT CAN BE COMPUTED WITH LOOPS OF BOUNDED LENGTH
Primitive recursive; Primitive recursive functions; Primitive recursion; Primitive recursive fuctions
In computability theory, a primitive recursive function is roughly speaking a function that can be computed by a computer program whose loops are all "for" loops (that is, an upper bound of the number of iterations of every loop can be determined before entering the loop). Primitive recursive functions form a strict subset of those general recursive functions that are also total functions.
Primitive recursive set function
Primitive recursive ordinal function
In mathematics, primitive recursive set functions or primitive recursive ordinal functions are analogs of primitive recursive functions, defined for sets or ordinals rather than natural numbers. They were introduced by .
Wikipedia
Recursive function
Recursive function may refer to:
- Recursive function (programming), a function which references itself
- General recursive function, a computable partial function from natural numbers to natural numbers
- Primitive recursive function, a function which can be computed with loops of bounded length
- Another name for computable function
